The Logic of Multisets Continued: The Case of Disjunction
نویسنده
چکیده
We continue our work [5] on the logic of multisets (or on the multiset semantics of linear logic), by interpreting further the additive disjunction t. To this purpose we employ a more general class of processes, called free, the axiomatization of which requires a new rule (not compatible with the full LL), the cancellation rule. Disjunctive multisets are modeled as finite sets of multisets. The t-Horn fragment of linear logic, with the cut rule slightly restricted, is sound with respect to this semantics. Another rule, which is a slight modification of cancellation, added to HFt makes the system sound and complete.
منابع مشابه
Truth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملGeneral definitions for the union and intersection of ordered fuzzy multisets
Since its original formulation, the theory of fuzzy sets has spawned a number of extensions where the role of membership values in the real unit interval $[0, 1]$ is handed over to more complex mathematical entities. Amongst the many existing extensions, two similar ones, the fuzzy multisets and the hesitant fuzzy sets, rely on collections of several distinct values to represent fuzzy membershi...
متن کاملON GENERALIZED FUZZY MULTISETS AND THEIR USE IN COMPUTATION
An orthogonal approach to the fuzzification of both multisets and hybridsets is presented. In particular, we introduce $L$-multi-fuzzy and$L$-fuzzy hybrid sets, which are general enough and in spirit with thebasic concepts of fuzzy set theory. In addition, we study the properties ofthese structures. Also, the usefulness of these structures is examined inthe framework of mechanical multiset proc...
متن کاملElementary Elimination of Prenex Cuts in Disjunction-free Intuitionistic Logic
The size of shortest cut-free proofs of first-order formulas in intuitionistic sequent calculus is known to be non-elementary in the worst case in terms of the size of given sequent proofs with cuts of the same formulas. In contrast to that fact, we provide an elementary bound for the size of cut-free proofs for disjunction-free intuitionistic logic for the case where the cut-formulas of the or...
متن کاملTowards Logic Programs with Ordered and Unordered Disjunction
Logic Programming paradigms that allow for expressing preferences have drawn a lot of research interest over the last years. Among them, the principle of ordered disjunction was developed to express totally ordered preferences for alternatives in rule heads. In this paper we introduce an extension of this approach called Disjunctive Logic Programs with Ordered Disjunction (DLPOD) that combines ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Studia Logica
دوره 75 شماره
صفحات -
تاریخ انتشار 2003